tree n. 特里〔姓氏〕。 n. 1.樹〔主要指喬木,也可指較大的灌木〕。 ★玫瑰可以稱為 bush, 也可以稱為 tree. 2.木料,木材;木構件;〔古語〕絞首臺;〔the tree〕(釘死耶穌的)十字架;鞋楦。 3.樹形(物),世系圖,家系 (=family tree);【數學】樹(形);【化學】樹狀晶體。 a banana tree 香蕉樹。 an axle-tree 心棒,軸料。 a boot-tree 靴楦[型]。 a saddle-tree 鞍架。 at the top of the tree 在最高地位。 tree of Buddha 菩提樹。 tree of heaven 臭椿。 tree of knowledge (of good and evil) 【圣經】知道善惡的樹,智慧之樹。 tree of life 生命之樹,生命力的源泉【植物;植物學】金鐘柏。 up a tree 〔口語〕進退兩難,不知所措。 vt. 趕(獵獸等)上樹躲避;〔口語〕使處于困境;窮追;把鞋型插入(鞋內)。
Different from the previous work , kf - diff + is tailored to both ordered trees and unordered trees . while dealing with the key path , the notion of the key constraint for semi - structure data and the notion of the multi - instance based keys are identified , which will greatly simplify the complexity of the algorithm 在特征路徑相關的計算中,本文引入面向半結構數據的key約束思想,并且針對先前判定算法過于復雜的問題,提出了基于多實例結點集合的key約束的概念以及相關的處理方法,在一定程度上簡化了計算。
To the former one , since most previous work depends on the signature of nodes , which would be costly to be computed , a new way is proposed to discriminate those nodes that have the same paths in the intrinsic properties of the xml document . towards this end , the thesis introduces a series of notions related to the key path , which make the change detection of xml document easier . based on the notions , a change detection algorithm named kf - diff is presented , which is tailored to unordered trees 對于前者,針對已有算法大多依賴非常耗時的結點簽名,并且算法過程復雜的問題,本文提出了一種文檔變化檢測的處理方法,該方法利用文檔固有信息建立特征參照體系,通過特征路徑相關的一系列概念的引入,將傳統標號樹匹配問題轉化為無重復路徑的標號樹匹配問題,有效地解決了路徑等價類比較的問題,簡化了xml文檔的比較。